An Improvement to the Number Field Sieve
نویسنده
چکیده
We improve the “sieve” part of the number field sieve used in factoring integer and computing discrete logarithm. The runtime of our method is shorter than that of existing methods. Under some reasonable assumptions, we prove that it is less than two-thirds of the running time of the algorithm used before asymptotically with probability greater than 0.6.
منابع مشابه
The Multiple Number Field Sieve with Conjugation and Generalized Joux-Lercier Methods
In this paper, we propose two variants of the Number Field Sieve (NFS) to compute discrete logarithms in medium characteristic finite fields. We consider algorithms that combine two ideas, namely the Multiple variant of the Number Field Sieve (MNFS) taking advantage of a large number of number fields in the sieving phase, and two recent polynomial selections for the classical Number Field Sieve...
متن کاملComputing Discrete Logarithms with the General Number Field Sieve
The diiculty in solving the discrete logarithm problem is of extreme cryptographic importance since it is widely used in signature schemes, message encryption, key exchange, authentication and so on ((15], 17], 21], 29] etc.). The General Number Field Sieve (GNFS) is the asymptotically fastest known method to compute discrete logs mod p 18]. With the rst implementation of the GNFS for discrete ...
متن کاملImprovements on the Individual Logarithm Step in Extended Tower Number Field Sieve
The hardness of discrete logarithm problem over finite fields is the foundation of many cryptographic protocols. When the characteristic of the finite field is medium or large, the state-of-art algorithms for solving the corresponding problem are the number field sieve and its variants. There are mainly three steps in such algorithms: polynomial selection, factor base logarithms computation, an...
متن کاملOn Class Group Computations Using the Number Field Sieve
The best practical algorithm for class group computations in imaginary quadratic number fields (such as group structure, class number, discrete logarithm computations) is a variant of the quadratic sieve factoring algorithm. Paradoxical as it sounds, the principles of the number field sieve, in a strict sense, could not be applied to number field computations, yet. In this article we give an in...
متن کاملImprovements on the Individual Logarithm Computation for Finite Fields with Composite Extension Degrees
The hardness of discrete logarithm problem over finite fields is the foundation of many cryptographic protocols. The state-of-art algorithms for solving the corresponding problem are number field sieve, function field sieve and quasi-polynomial time algorithm when the characteristics of the finite field are medium to large, medium-small and small, respectively. There are mainly three steps in s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1103.1493 شماره
صفحات -
تاریخ انتشار 2011